1.Almeida, M., Moreira, N. and Reis, R. 2007. On the performance of automata minimization algorithms. In Proceedings of the 4th Conference on Computation in Europe: Logic and Theory of Algorithms, pp. 3-14.

2.Amit Kishor Shukla, A.S. 2015. State Minimization Approach in Deterministic Finite Automata using Inefficient State Elimination Approach. International Journal of Advance Research in Computer Science and Management Studies, 3(12): 20-28.

3.Basten, H.J.S. 2011. Ambiguity detection methods for context-free grammars (Doctoral dissertation, University of Amsterdam).

4.Berry, G. and Sethi, R. 1986. From Regular Expressions to Deterministic Automata, Theoretical Computer Science, 48: 117-126.

5.Champarnaud, J.M., Ponty, J.L. and Ziadi, D. 1999. From regular expressions to Finite Automata. International Journal of Computer Mathematics, 72(4): 415-431.

6.Champarnaud, J.M., Ponty, J.L. and Ziadi, D. 1999. From regular expressions to Finite Automata. International Journal of Computer Mathematics, 72(4): 415-431.

7.Chang, C.H. and Paige, R. 1992. From regular expressions to dfa’s using compressed nfa’s. In Annual Symposium on Combinatorial Pattern Matching, pp. 90-110. Springer, Berlin, Heidelberg.

8.Chang, C.H. and Paige, R. 1997. From regular expressions to DFA’s using compressed NFA’s. Theoretical Computer Science, 178(1-2): 1-36.

9.Chhabra, T. and Kuymar, A. 2012. New heuristics for conversion of Deterministic Finite Automata to Regular expression. International Journal of Advanced Research in Computer Science, 3(4).

10.Choubey, A. and Ravi, K.M. 2013. Minimization of deterministic Finite Automata with vague (final) states and intuitionistic fuzzy (final) states. Iranian Journal of Fuzzy Systems, 10(1): 75-88.

11.Gruber, H. and Holzer, M. 2015. From Finite Automata to regular expressions and back—a summary on descriptional complexity. International Journal of Foundations of Computer Science, 26(08): 1009-1040.